Optimal and near-optimal encoders for short and moderate-length tailbiting trellises
نویسنده
چکیده
The results of an extensive search for short and moderatelength polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R = 1=4; 1=3; 1=2; and 2=3 are reported. The tail-biting representations found are typically as good as the best known block codes.
منابع مشابه
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
The results of an extensive search for short and moderatelength polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R = 1=4; 1=3; 1=2; and 2=3 are reported. The tail-biting representations found are typically as good as the best known block codes.
متن کاملML Decoding of Block Codes on their Tailbiting Trellises
A m a x i m u m likelihood decoding algo-r i t h m is presented for tailbiting trellises for block codes. The algorithm works in t w o phases. The first phase is a V i t e r b i decoding algorithm on the tailbiting trellis, while the second uses the A* algorithm adapted for application in this context. Results of simulations on tailbiting trellises for some block codes, indicate that t h i s de...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملState diagram approach to feedback encoders for tailbiting codes
—An algorithm for finding the starting state of a feedback tailbiting encoder is proposed, based solely on the properties of the encoder state diagram. With this approach, conditions for the existence of a tailbiting code generated by such an encoder are naturally tested in the process of preparing a certain permutation table for the starting state determination algorithm. A tailbiting failure ...
متن کاملError-Trellis Construction for Tailbiting Convolutional Codes
Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017